Optimal CDMA Signatures: A

نویسندگان

  • Joel A. Tropp
  • Robert W. Heath
چکیده

A description of optimal sequences for direct-spread code division multiple access is a byproduct of recent characterizations of the sum capacity. This papers restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that obtains the sequences directly instead of computing the Gram matrix of the optimal signatures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Signature Adaptation for Capacity Maximization of CDMA Systems

For single cell synchronous code division multiple access (CDMA) systems, both the information theoretic capacity and the network capacity have been identi ed. In both cases, it was shown that if the number of users, N , is no more than the processing gain, L, then orthogonal signatures are optimal while if N > L, then signatures which satisfy the Welch bound on the total squared correlation wi...

متن کامل

Separability and Gain Control for Overloaded CDMA

In overloaded CDMA systems the high correlation among users’ signatures determines an overall performace that can be quite poor even for the optimal ML receiver. The geometric properties of signatures affect users’ separability, a condition that is necessary for achieving asymptotic efficiency. In this paper we establish gaussian separability conditions and propose an algorithm for the design o...

متن کامل

Optimal CDMA Signatures: A Finite-Step Approach - Spread Spectrum Techniques and Applications, 2004 IEEE Eighth International Symposium on

A description of optimal sequences for direct-spread code division multiple access is a byproduct of recent characterizations of the sum capacity. This papers restates the sequence design problem as an inverse singular value problem and shows that it can be solved with finite-step algorithms from matrix analysis. Relevant algorithms are reviewed and a new one-sided construction is proposed that...

متن کامل

A simple approach to near-optimal multiuser detection: interleave-division multiple-access

This paper presents an asynchronous interleavedivision multiple-access (IDMA) scheme, in which users are distinguished by different chip-level interleaving methods instead of by different signatures as in a conventional code-division multiple-access (CDMA) scheme. A very low-cost iterative detection algorithm is derived for the IDMA scheme based on a chip-by-chip detection principle. The propos...

متن کامل

CDMA Signature Sequences with Low Peak-to-Average-Power Ratio via Alternating Projection

Several algorithms have been proposed to construct optimal signature sequences that maximize the sum capacity of the uplink in a direct-spread synchronous code division multiple access (CDMA) system. These algorithms produce signatures with real-valued or complexvalued entries that generally have a large peak-to-average power ratio (PAR). This paper presents an alternating projection algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004